Binary Polar Codes are Optimized Codes for Bitwise Multistage Decoding
نویسندگان
چکیده
Polar codes are considered the latest major breakthrough in coding theory. Polar codes were introduced by Arıkan in 2008. In this letter, we show that the binary polar codes are the same as the optimized codes for bitwise multistage decoding (OCBM), which have been discovered before by Stolte in 2002. The equivalence between the techniques used for the constructions and decodings of both codes is established.
منابع مشابه
Properties and Construction of Polar Codes
Recently, Arıkan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel. In the thesis, we show that decoding algorithm of polar codes, called successive cancellation decoding, can be regarded as belief propagation decoding, which has been used for decoding of low-density parity-...
متن کاملPermutation decoding of Z 2 Z 4 - linear codes
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As pa...
متن کاملList Decoding for Reed-Muller Codes and Its Application to Polar Codes
Gopalan, Klivans, and Zuckerman proposed a list-decoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using wellknown Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a natural genera...
متن کاملPerformance of binary polar codes with high - dimensional kernel 1
Upper union bound for the decoding error probability of polar codes with arbitrary binary kernels under the successive cancellation decoding is derived. The proposed approach is based on the representation of polar codes as multilevel ones.
متن کاملPerformance of binary polar codes with high-dimensional kernel
Upper union bound for the decoding error probability of polar codes with arbitrary binary kernels under the successive cancelation decoding is derived. The proposed approach is based on the representation of polar codes as multilevel ones.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1604.03612 شماره
صفحات -
تاریخ انتشار 2016